A remark on vertex index of the convex bodies
نویسندگان
چکیده
The vertex index of a symmetric convex body K ⊂ Rn, vein(K), was introduced in [BL]. Bounds on the vertex index were given in the general case as well as for some basic examples. In this note we improve these bounds and discuss their sharpness. We show that vein(K) ≤ 24n, which is asymptotically sharp. We also show that the estimate n3/2 √ 2πe ovr(K) ≤ vein(K), obtained in [BL] (here ovr(K) denotes the outer volume ratio of K), is not always sharp. Namely, we construct an example showing that there exists a symmetric convex body K which simultaneously has large outer volume ratio and large vertex index. Finally, we improve the constant in the latter bound for the case of the Euclidean ball from √ 2πe to √ 3, providing a completely new approach to the problem.
منابع مشابه
The Covering Index of Convex Bodies
Covering a convex body by its homothets is a classical notion in discrete geometry that has resulted in a number of interesting and long-standing problems. Swanepoel [Mathematika 52 (2005), 47–52] introduced the covering parameter of a convex body as a means of quantifying its covering properties. In this paper, we introduce a relative of the covering parameter called covering index, which turn...
متن کاملOn the vertex index of convex bodies
We introduce the vertex index, vein(K), of a given centrally symmetric convex body K ⊂ Rd, which, in a sense, measures how well K can be inscribed into a convex polytope with small number of vertices. This index is closely connected to the illumination parameter of a body, introduced earlier by the first named author, and, thus, related to the famous conjecture in Convex Geometry about covering...
متن کاملOn vertex balance index set of some graphs
Let Z2 = {0, 1} and G = (V ,E) be a graph. A labeling f : V → Z2 induces an edge labeling f* : E →Z2 defined by f*(uv) = f(u).f (v). For i ε Z2 let vf (i) = v(i) = card{v ε V : f(v) = i} and ef (i) = e(i) = {e ε E : f*(e) = i}. A labeling f is said to be Vertex-friendly if | v(0) − v(1) |≤ 1. The vertex balance index set is defined by {| ef (0) − ef (1) | : f is vertex-friendly}. In this paper ...
متن کاملAsymmetry of Convex Polytopes and Vertex Index of Symmetric Convex Bodies
In (Gluskin, Litvak in Geom. Dedicate 90:45–48, 2002) it was shown that a polytope with few vertices is far from being symmetric in the Banach–Mazur distance. More precisely, it was shown that Banach–Mazur distance between such a polytope and any symmetric convex body is large. In this note we introduce a new, averaging-type parameter to measure the asymmetry of polytopes. It turns out that, su...
متن کاملComputing the convex hull of a planar point set
In Figure 1, the set S consists of thirteen points. The output of a convex hull algorithm should be the list (p1, p2, p3, p4, p5, p6). We remark that the list storing the vertices of CH (S) can start with an arbitrary vertex. In the example, the list (p3, p4, p5, p6, p1, p2) would also be a valid output. ∗School of Computer Science, Carleton University, Ottawa, Ontario, Canada K1S 5B6. E-mail: ...
متن کامل